Approximate Bayesian Computation for Smoothing
نویسندگان
چکیده
We consider a method for approximate inference in hidden Markov models (HMMs). The method circumvents the need to evaluate conditional densities of observations given the hidden states. It may be considered an instance of Approximate Bayesian Computation (ABC) and it involves the introduction of auxiliary variables valued in the same space as the observations. The quality of the approximation may be controlled to arbitrary precision through a parameter > 0. We provide theoretical results which quantify, in terms of , the ABC error in approximation of expectations of additive functionals with respect to the smoothing distributions. Under regularity assumptions, this error is O(n ), where n is the number of time steps over which smoothing is performed. For numerical implementation we adopt the forward-only sequential Monte Carlo (SMC) scheme of [16] and quantify the combined error from the ABC and SMC approximations. This forms some of the first quantitative results for ABC methods which jointly treat the ABC and simulation errors, with a finite number of data and simulated samples. When the HMM has unknown static parameters, we consider particle Markov chain Monte Carlo [2] (PMCMC) methods for batch statistical inference. Key-words: Smoothing, Hidden Markov Models, Approximate Bayesian Computation, Sequential Monte Carlo, Markov chain Monte Carlo.
منابع مشابه
Hyperparameter Selection for Self-Organizing Maps
The self-organizing map (SOM) algorithm for finite data is derived as an approximate MAP estimation algorithm for a Gaussian mixture model with a Gaussian smoothing prior, which is equivalent to a generalized deformable model (GDM). For this model, objective criteria for selecting hyperparameters are obtained on the basis of empirical Bayesian estimation and crossvalidation, which are represent...
متن کاملA parallel training algorithm for hierarchical pitman-yor process language models
The Hierarchical Pitman Yor Process Language Model (HPYLM) is a Bayesian language model based on a nonparametric prior, the Pitman-Yor Process. It has been demonstrated, both theoretically and practically, that the HPYLM can provide better smoothing for language modeling, compared with state-of-the-art approaches such as interpolated KneserNey and modified Kneser-Ney smoothing. However, estimat...
متن کاملAnalysis of Mortality Data using Smoothing Spline Poisson Regression
We study a smoothing spline Poisson regression model for the analysis of mortality data. Being a non-parametric approach it is intrinsically robust, that it is a penalized likelihood estimation method makes available an approximate Bayesian confidence interval and importantly the software gss, its implementation on the freely available statistical package R, makes it easily accessible to the us...
متن کاملFundamentals and Recent Developments in Approximate Bayesian Computation
Bayesian inference plays an important role in phylogenetics, evolutionary biology, and in many other branches of science. It provides a principled framework for dealing with uncertainty and quantifying how it changes in the light of new evidence. For many complex models and inference problems, however, only approximate quantitative answers are obtainable. Approximate Bayesian computation (ABC) ...
متن کاملBayesian Analysis of Multivariate Smoothing Splines
A general version of multivariate smoothing splines with correlated errors and correlated curves is proposed. A suitable symmetric smoothing parameter matrix is introduced, and practical priors are developed for the unknown covariance matrix of the errors and the smoothing parameter matrix. An efficient algorithm for computing the multivariate smoothing spline is derived, which leads to an effi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012